Search results for "Relational calculus"

showing 2 items of 2 documents

Deciding properties of integral relational automata

1994

This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.

Model checkingDiscrete mathematicsClass (set theory)TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComputer scienceComputer Science::Software EngineeringDecidabilityUndecidable problemComputer Science::Multiagent SystemsCTL*TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRelational calculusTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceAutomata theoryTime complexityComputer Science::Formal Languages and Automata Theory
researchProduct

A Representation of Relational Systems

2003

In this paper elements of a theory of multistructures are formulated. The theory of multistructures is used to define a binary representation of relational systems.

Theoretical computer scienceRelational calculusRelational databaseCodd's theoremComputer scienceStatistical relational learningRelational modelConjunctive queryDomain relational calculusRelational Model/Tasmania
researchProduct